An Eecient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3
نویسندگان
چکیده
The paper considers the problem of computing a maximal independent set in a hypergraph (see 3] and 7]). We present an eecient deterministic NC algorithm for nding a maximal independent set in a hypergraph of dimension 3: the algorithm runs in time O(log 4 n) time on n + m processors of an EREW PRAM and is optimal up to a polylogarithmic factor. Our algorithm adapts the technique of Goldberg and Spencer ((5]) for nding a maximal independent set in a graph (or hypergraph of dimension 2). It is the rst NC algorithm for nding a maximal independent set in a hypergraph of dimension greater than 2.
منابع مشابه
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3
The paper considers the problem of computing a maximal independent set in a hypergraph (see 3] and 7]). We present an eecient deterministic NC algorithm for nding a maximal independent set in a hypergraph of dimension 3: the algorithm runs in time O(log 4 n) time on n + m processors of an EREW PRAM and is optimal up to a polylogarithmic factor. Our algorithm adapts the technique of Goldberg and...
متن کاملOn Computing a Maximal Independent Set in Hypergraph in Parallel
An outstanding open question in the theory of parallel computation is whether a maximal independent set (MIS) in a given hypergraph, can be computed in NC or RNC. One major bottleneck seems to be controlling the dimension of the hypergraph, i.e. the maximum dimension of a hyperedge. In the case of graphs (dimension 2 hypergraphs), Karp and Wigderson’85 gave the first NC algorithm. In the case o...
متن کاملAnalysis of parallel algorithms for finding a maximal independent set in a random hypergraph
It is well known 9] that nding a maximal independent set in a graph is in class N C, and 10] that nding a maximal independent set in a hypergraph with xed dimension is in RN C. It is not known whether this latter problem remains in N C when the dimension is part of the input. We will study the problem when the problem instances are randomly chosen. It was shown in 6] that the expected running t...
متن کاملAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کاملAn Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension∗
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کامل